∂x2 be the Laplacian in R
نویسنده
چکیده
The last twenty years has seen considerable and fruitful research in the field of nonsmooth boundary value problems (BVP’s) for partial differential equations. The objective is to understand the behavior and properties of solutions to either variable coefficient equations with minimal regularity assumptions on the coefficients or to linear constant coefficient equations in domains with nonsmooth boundary. An example of the latter is the following. Let ∆ = ∑
منابع مشابه
Laplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کاملSpectral and Hardy Inequalities for the Heisenberg Laplacian
In this thesis we consider the first Heisenberg group and study spectral properties of the Dirichlet sub-Laplacian, also known as Heisenberg Laplacian, which is a sum-ofsquares differential operator of left-invariant vector fields on the first Heisenberg group. In particular, we consider the bound for the trace of the eigenvalues which reflects the correct geometrical constant and order of grow...
متن کاملThe Signless Laplacian Estrada Index of Unicyclic Graphs
For a simple graph $G$, the signless Laplacian Estrada index is defined as $SLEE(G)=sum^{n}_{i=1}e^{q^{}_i}$, where $q^{}_1, q^{}_2, dots, q^{}_n$ are the eigenvalues of the signless Laplacian matrix of $G$. In this paper, we first characterize the unicyclic graphs with the first two largest and smallest $SLEE$'s and then determine the unique unicyclic graph with maximum $SLEE$ a...
متن کاملOn Canonical Graphs and the Laplacian Characteristic Polynomial
Let G be a simple graph of order n with vertex set V (G) = {1, 2, . . . , n}. For any (x1, x2, . . . , xn) ∈ I ∗ , where I∗ = {0, 1}, let G(x1, x2, . . . , xn) be the subgraph of G which is obtained by deleting the vertices i1, i2, . . . , ij ∈ V (G) (0 ≤ j ≤ n), provided that xi1 = xi2 = · · · = xij = 0. Let G[x1, x2, . . . , xn] be the characteristic polynomial of G(x1, x2, . . . , xn), under...
متن کاملOn Laplacian energy of non-commuting graphs of finite groups
Let $G$ be a finite non-abelian group with center $Z(G)$. The non-commuting graph of $G$ is a simple undirected graph whose vertex set is $Gsetminus Z(G)$ and two vertices $x$ and $y$ are adjacent if and only if $xy ne yx$. In this paper, we compute Laplacian energy of the non-commuting graphs of some classes of finite non-abelian groups..
متن کاملOptimum decoder for multiplicative spread spectrum image watermarking with Laplacian modeling
This paper investigates the multiplicative spread spectrum watermarking method for the image. The information bit is spreaded into middle-frequency Discrete Cosine Transform (DCT) coefficients of each block of an image using a generated pseudo-random sequence. Unlike the conventional signal modeling, we suppose that both signal and noise are distributed with Laplacian distribution, because the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996